The Gaussian Integers I: the Fundamental Theorem
نویسنده
چکیده
Earlier we justified our proof of the fundamental theorem of arithmetic by arguing that the result was not obvious, since its analogue in the ring E of even integers did not hold. Here we will explore a far more exciting explanation: essentially the same proof can be used to show that certain other “integer-like rings” have the unique factorization property. The unique factorization property can be formulated in any integral domain: that is, one has the notion of a unique factorization domain (or UFD). Rather than begin with this general (purely algebraic) notion here, we choose to keep a more properly number-theoretic focus and start with a particular ring which will be very important for us in the rest of the course. Namely, we consider the ring Z[i] of Gaussian integers. Here i = √−1, and the easiest way to view Z[i] is as the subring of complex numbers {a+bi | a, b ∈ Z}, i.e., those complex numbers whose x and y coordinates are integers. In other words, the Gaussian integers are just the lattice points in the plane, added and multiplied as complex numbers. Let us check that this is a subring of C. It contains 0 = 0 + 0i and 1 = 1 + 0i. Moreover it is certainly closed under addition: (a+bi)+(c+di) = (a+c)+(b+d)i, and if all of a, b, c, d are integers, so are a + c and b + d. Finally we have to check closure under multiplication:
منابع مشابه
Extension and Generalization of Fermat’s Little Theorem to the Gaussian Integers
It can . . . come as a bit of a shock to meet your first non-obvious theorem, which will typically be Fermat’s Little Theorem. — Dominic Yeo [10] The non-obviousness of Fermat’s Little Theorem is the most interesting part of any introductory number theory course. We are therefore motivated to determine if Fermat’s Little Theorem can be extended to the Gaussian integers, as many other useful pro...
متن کاملA Structure Theorem for Multiplicative Functions over the Gaussian Integers and Applications
We prove a structure theorem for multiplicative functions on the Gaussian integers, showing that every bounded multiplicative function on the Gaussian integers can be decomposed into a term which is approximately periodic and another which has a small U3-Gowers uniformity norm. We apply this to prove partition regularity results over the Gaussian integers for certain equations involving quadrat...
متن کاملOn the Probability of Relative Primality in the Gaussian Integers
This paper studies the interplay between probability, number theory, and geometry in the context of relatively prime integers in the ring of integers of a number field. In particular, probabilistic ideas are coupled together with integer lattices and the theory of zeta functions over number fields in order to show that P (gcd(z1, z2) = 1) = 1 ζQ(i)(2) where z1, z2 ∈ Z[i] are randomly chosen and...
متن کاملA GENERALIZATION OF A JACOBSON’S COMMUTATIVITY THEOREM
In this paper we study the structure and the commutativity of a ring R, in which for each x,y ? R, there exist two integers depending on x,y such that [x,y]k equals x n or y n.
متن کاملA More General Version of the Costa Theorem
In accordance with the Costa theorem, the interference which is independent of the channel input and known non-causally at the transmitter, does not affect the capacity of the Gaussian channel. In some applications, the known interference depends on the input and hence has some information. In this paper, we study the channel with input dependent interference and prove a capacity theorem that n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007